Univariate Marginal Distribution Algorithm in Combination with Extremal Optimization (EO, GEO)

نویسندگان

  • Mitra Hashemi
  • Mohammad Reza Meybodi
چکیده

The UMDA algorithm is a type of Estimation of Distribution Algorithms. This algorithm has better performance compared to others such as genetic algorithm in terms of speed, memory consumption and accuracy of solutions. It can explore unknown parts of search space well. It uses a probability vector and individuals of the population are created through the sampling. Furthermore, EO algorithm is suitable for local search of near global best solution in search space, and it dose not stuck in local optimum. Hence, combining these two algorithms is able to create interaction between two fundamental concepts in evolutionary algorithms, exploration and exploitation, and achieve better results of this paper represent the performance of the proposed algorithm on two NP-hard problems, multi processor scheduling problem and graph bi-partitioning problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Extremal Optimization for Solving Complex Optimal Design Problems

Recently, Boettcher and Percus [1] proposed a new optimization method, called Extremal Optimization (EO), inspired by a simplified model of natural selection developed to show the emergence of Self-Organized Criticality (SOC) in ecosystems [2]. Although having been successfully applied to hard problems in combinatorial optimization, a drawback of the EO is that for each new optimization problem...

متن کامل

Multi-objective Optimization with Combination of Particle Swarm and Extremal Optimization for Constrained Engineering Design

Engineering optimization problems usually have several conflicting objectives, such that no single solution can be considered optimum with respect to all objectives. In recent years, many efforts have focused on hybrid metaheuristic approaches for their robustness and efficiency to solve the above-mentioned multiobjective optimization problems (MOPs). This paper proposes a novel hybrid algorith...

متن کامل

Exploring Applications of Extremal Optimization

Extremal Optimization (EO) is a relatively new single search-point optimization heuristic based on self-organized criticality. Unlike many traditional optimization heuristics, EO focuses on removing poor characteristics of a solution instead of preserving the good ones. This thesis will examine the physical and biological inspirations behind EO, and will explore the application of EO on four un...

متن کامل

A comparison of extremal optimization with flat-histogram dynamics for finding spin-glass ground states

We compare the performance of extremal optimization (EO), flathistogram and equal-hit algorithms for finding spin-glass ground states. The first-passage-times to a ground state are computed. At optimal parameter of τ = 1.15, EO outperforms other methods for small system sizes, but equal-hit algorithm is competitive to EO, particularly for large systems. Flat-histogram and equal-hit algorithms o...

متن کامل

A novel hybrid algorithm with marriage of particle swarm optimization and extremal optimization

Particle swarm optimization (PSO) has received increasing interest from the optimization community due to its simplicity in implementation and its inexpensive computational overhead. However, PSO has premature convergence, especially in complex multimodal functions. Extremal Optimization (EO) is a recently developed local-search heuristic method and has been successfully applied to some NP-hard...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011